Systems of k Boolean inequations and a Boolean equation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Treatment of Boolean Equations and Inequations

We are given a set of equations and inequations over some boolean variables; henceforth, we call each equation and inequation a fact. An equation is written as x ∼ y, denoting that x and y are known to be equal, and an inequation as x | y, denoting that x and y are known to be unequal (note that ∼ and | are mutually exclusive, though they are not negations of each other, because no relationship...

متن کامل

Parameterised boolean equation systems

Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on transition systems (see [18] for an excellent treatment). We are interested in an extension of boolean equation systems with data. This allows to formulate and prove a substantially wider range of properties on much larger and even infinite state systems. In previous works [11, 15] it has been outlined ho...

متن کامل

Eecient Diagnostic Generation for Boolean Equation Systems Eecient Diagnostic Generation for Boolean Equation Systems

Boolean Equation Systems (Bess) provide a useful framework for the veriica-tion of concurrent nite-state systems. In practice, it is desirable that a Bes resolution also yields diagnostic information explaining, preferably in a concise way, the truth value computed for a given variable of the Bes. Using a representation of Bess as extended boolean graphs (Ebgs), we propose a characterization of...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

Eliminating Variables in Boolean Equation Systems

Systems of Boolean equations of low degree arise in a natural way when analyzing block ciphers. The cipher’s round functions relate the secret key to auxiliary variables that are introduced by each successive round. In algebraic cryptanalysis, the attacker attempts to solve the resulting equation system in order to extract the secret key. In this paper we study algorithms for eliminating the au...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2020

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil2004261m